Recognizing Stick Graphs with and without Length Constraints
نویسندگان
چکیده
منابع مشابه
Recognizing Humor Without Recognizing Meaning
We present a machine learning approach for classifying sentences as one-liner jokes or normal sentences. We use no deep analysis of the meaning to try to see if it is humorous, instead we rely on a combination of simple features to see if these are enough to detect humor. Features such as word overlap with other jokes, presence of words common in jokes, ambiguity and word overlap with common id...
متن کاملOn list vertex 2-arboricity of toroidal graphs without cycles of specific length
The vertex arboricity $rho(G)$ of a graph $G$ is the minimum number of subsets into which the vertex set $V(G)$ can be partitioned so that each subset induces an acyclic graph. A graph $G$ is called list vertex $k$-arborable if for any set $L(v)$ of cardinality at least $k$ at each vertex $v$ of $G$, one can choose a color for each $v$ from its list $L(v)$ so that the subgraph induced by ev...
متن کاملRecognizing HHDS-Free Graphs
In this paper, we consider the recognition problem on the HHDS-free graphs, a class of homogeneously orderable graphs, and we show that it has polynomial time complexity. In particular, we describe a simple O(nm)-time algorithm which determines whether a graph G on n vertices and m edges is HHDS-free. To the best of our knowledge, this is the first polynomial-time algorithm for recognizing this...
متن کاملRecognizing Berge Graphs
A graph is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one. In this paper we give an algorithm to test if a graph G is Berge, with running time O(|V (G)|). This is independent of the recent proof of the strong perfect graph conjecture.
متن کاملRecognizing k-path Graphs
The k-path graph Pk(H) of a graph H has all length-k paths of H as vertices; two such vertices are adjacent in the new graph if their union forms a path or cycle of length k + 1 in H , and if the common edges of both paths form a path of length k − 1. In this paper we give a (nonpolynomial) recognition algorithm for k-path graphs, for every integer k¿2. The algorithm runs in polynomial time if ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2020
ISSN: 1526-1719
DOI: 10.7155/jgaa.00524